P-selective Self-reducible Sets: a New Characterization of P
نویسندگان
چکیده
We show that any p-selective and self-reducible set is in P. As the converse is also true, we obtain a new characterization of the class P. A generalization and several consequences of this theorem are discussed. Among other consequences, we show that under reasonable assumptions auto-reducibility and self-reducibility diier on NP, and that there are non-p-T-mitotic sets in NP.
منابع مشابه
P-Selective Self-reducibles Sets: A New Characterization of P
Separating complexity classes is a very popular, but rarely won game in complexity theory. Frustrated by misfortune, computer scientists have often turned to attempts of characterizing complexity classes in a different way. The hopes are, that the new characterization of the complexity class may provide new insights and a ``handle'' to force the separation where earlier attempts have failed. We...
متن کاملOn the reducibility of sets inside NP to sets with low information content
We study whether sets inside NP can be reduced to sets with low information content but possibly still high computational complexity. Examples of sets with low information content are tally sets, sparse sets, P-selective sets and membership comparable sets. For the graph automorphism and isomorphism problems GA and GI, for the directed graph reachability problem GAP, for the determinant functio...
متن کاملP-Selective Sets, and Reducing Search to Decision vs. Self-Reducability
We obtain several results that distinguish self-reducibility of a language L with the question of whether search reduces to decision for L. These include: (i) If NE 6 = E, then there exists a set L in NP ? P such that search reduces to decision for L, search does not nonadaptively reduces to decision for L, and L is not self-reducible. 1 (ii) If UE 6 = E, then there exists a language L 2 UP ? P...
متن کاملCombining Self-reducibility and Partial Information Algorithms
A partial information algorithm for a language A computes, for some fixed m, for input words x1, . . . , xm a set of bitstrings containing χA(x1, . . . , xm). E.g., p-selective, approximable, and easily countable languages are defined by the existence of polynomial-time partial information algorithms of specific type. Self-reducible languages, for different types of self-reductions, form subcla...
متن کاملApproximable Sets Universitt at Karlsruhe
Much structural work on NP-complete sets has exploited SAT's d-self-reduci-bility. In this paper we exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P = NP. In fact, every set that is NP-hard under polynomial-time n o(1)-tt reductions is p-superterse unless P = NP. In particular no p-selective set is NP-hard under polynomial-time n o(1)-...
متن کامل